Min-Max Regret Robust Optimization Approach on Interval Data Uncertainty
نویسندگان
چکیده
منابع مشابه
A Min-max Regret Robust Optimization Approach for Large Scale Full Factorial Scenario Design of Data Uncertainty
This paper presents a three-stage optimization algorithm for solving two-stage robust decision making problems under uncertainty with min-max regret objective. The structure of the first stage problem is a general mixed integer (binary) linear programming model with a specific model of uncertainty that can occur in any of the parameters, and the second stage problem is a linear programming mode...
متن کاملMin-max-min Robust Combinatorial Optimization Subject to Discrete Uncertainty
We consider combinatorial optimization problems with uncertain objective functions. In the min-max-min robust optimization approach, a fixed number k of feasible solutions is computed such that the respective best of them is optimal in the worst case. The idea is to calculate a set of candidate solutions in a potentially expensive preprocessing and then select the best solution out of this set ...
متن کاملMin-max-min robust combinatorial optimization
The idea of k-adaptability in two-stage robust optimization is to calculate a fixed number k of second-stage policies here-and-now. After the actual scenario is revealed, the best of these policies is selected. This idea leads to a min-max-min problem. In this paper, we consider the case where no first stage variables exist and propose to use this approach to solve combinatorial optimization pr...
متن کاملMin-Max Regret Scheduling To Minimize the Total Weight of Late Jobs With Interval Uncertainty
We study the single machine scheduling problem with the objective to minimize the total weight of late jobs. It is assumed that the processing times of jobs are not exactly known at the time when a complete schedule must be dispatched. Instead, only interval bounds for these parameters are given. In contrast to the stochastic optimization approach, we consider the problem of finding a robust sc...
متن کاملMin-max-min robustness: a new approach to combinatorial optimization under uncertainty based on multiple solutions
In the classical min-max approach to robust combinatorial optimization, a single feasible solution is computed that optimizes the worst case over a given set of considered scenarios. As is well known, this approach is very conservative, leading to solutions that in the average case are far from being optimal. In this paper, we present a different approach: the objective is to compute k feasible...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Optimization Theory and Applications
سال: 2007
ISSN: 0022-3239,1573-2878
DOI: 10.1007/s10957-007-9334-6